Quantum Entropy and Complexity
نویسندگان
چکیده
منابع مشابه
Quantum Entropy and Complexity
We study the relations between the recently proposed machine-independent quantum complexity of P. Gacs [1] and the entropy of classical and quantum systems. On one hand, by restricting Gacs complexity to ergodic classical dynamical systems, we retrieve the equality between the Kolmogorov complexity rate and the Shannon entropy rate derived by A.A. Brudno [2]. On the other hand, using the quantu...
متن کاملGacs Quantum Complexity and Quantum Entropy
The development of quantum information theory motivated the extension to the quantum realm of notions from algorithmic complexity theory. Because of the structure of quantum mechanics, several inequivalent generalizations are possible. The same phenomenon characterizes the extension of the dynamical entropy of Kolmogorov and Sinai. In the following, we shall examine the relations between the qu...
متن کاملInvariant Entropy and Complexity of Quantum States
The concept of entropy is fundamental for many branches of physics and other sciences dealing with systems which reveal a certain degree of complexity and disorder. As stressed in the monograph 1, ‘‘entropy is not a single concept but rather a family of notions". In relation to quantum theory, the mainstream of development is formed by four main overlapping lines. They can be referred to as the...
متن کاملEntropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem
In classical information theory, entropy rate and algorithmic complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum Kolmogorov complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them a...
متن کاملQuantum query complexity of entropy estimation
Estimation of Shannon and Rényi entropies of unknown discrete distributions is a fundamental problem in statistical property testing and an active research topic in both theoretical computer science and information theory. Tight bounds on the number of samples to estimate these entropies have been established in the classical setting, while little is known about their quantum counterparts. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Systems & Information Dynamics
سال: 2017
ISSN: 1230-1612,1793-7191
DOI: 10.1142/s1230161217500056